منابع مشابه
Primeless Modular Cryptography
Most of the known public-key cryptosystems have an overall complexity which is dominated by the keyproduction algorithm, which requires the generation of prime numbers. This is most inconvenient in settings where the key-generation is not an one-off process, e.g., secure delegation of computation or EKE password-based key exchange protocols. To this end, we extend the Goldwasser-Micali (GM) cry...
متن کاملLow-Power Elliptic Curve Cryptography Using Scaled Modular Arithmetic
We introduce new modulus scaling techniques for transforming a class of primes into special forms which enables efficient arithmetic. The scaling technique may be used to improve multiplication and inversion in finite fields. We present an efficient inversion algorithm that utilizes the structure of scaled modulus. Our inversion algorithm exhibits superior performance to the Euclidean algorithm...
متن کاملFast Arithmetics Using Chinese Remaindering
In this paper, some issues concerning the Chinese remaindering representation are discussed. Some new converting methods, including an efficient probabilistic algorithm based on a recent result of von zur Gathen and Shparlinski [5], are described. An efficient refinement of the NC division algorithm of Chiu, Davida and Litow [2] is given, where the number of moduli is reduced by a factor of logn.
متن کاملAn Enhanced Residue Modular Multiplier for Cryptography
This paper presents an implementation of VLSI architecture for Dual Field Residue Arithmetic modular multiplier with less delay based on finite field arithmetic to support all public key cryptographic applications. A new method for incorporating Residue Number System (RNS) and Polynomial Residue Number system (PRNS) in modular multiplication is derived and then implemented VLSI Architecture for...
متن کاملPublic-Key Cryptography Based on Modular Lattices
We present an approach to generalization of practical Identity-Based Encryption scheme of [BF01]. In particular we show how the protocol could be used on finite modular lattices and as a special case on vector spaces over finite field. The original proof of security for this protocol does not hold in this general algebraic structure, thus this is still a work in progress.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of New Technology and Research
سال: 2019
ISSN: 2454-4116
DOI: 10.31871/ijntr.5.6.6